Green Scheduling of Identical Parallel Machines with Release Date, Delivery Time and No-Idle Machine Constraints
نویسندگان
چکیده
Global warming and climate change are threatening life on earth. These changes due to human activities resulting in the emission of greenhouse gases. This is caused by intensive industrial excessive fuel energy consumption. Recently, scheduling production systems has been judged be an effective way reduce field green scheduling, which aims allocate jobs machines order minimize total costs, with a focus sustainable use energy. Several studies have investigated parallel-machine shops, special reducing minimizing consumed Few explicitly include idle parallel machines, when idle. In addition, very few considered elimination machine times as efficient no-idle constraint, aspect research. this context, paper addresses problem, including release dates, delivery times, objective maximum completion time. problem practical interest since it encountered several industry processes, such steel automobile industries. A mixed-integer linear programming (MILP) model proposed for obtaining exact solutions small-sized instances. Due NP-hardness studied encouraged successful adaptation metaheuristics problems, three genetic algorithms (GAs) using different crossover operators simulated annealing algorithm (SA) were developed large-sized problems. new family lower bounds proposed. was intended evaluation performance over average percent relative deviation (ARPD). evaluated percentage saved energy, while eliminating idle-machine times. An extensive experimental study carried out benchmark test problems up 200 eight machines. showed that one GA variant dominated other procedures. Furthermore, obtained numerical results provide strong evidence outperformed existing procedures from literature. The also adoption time constraints made possible 29.57%, makespan (cost) increased only 0.12%.
منابع مشابه
Scheduling identical parallel machines with tooling constraints
We model and solve the problem of sequencing a set of jobs with specified processing times and tool requirements on a set of identical parallel machines. Decisions concern the assignment of jobs to machines, their sequencing, and the allocation of tools on each machine. The objective function minimizes the makespan. We propose an adaptive large neighborhood search metaheuristic in which the des...
متن کاملNo-wait flexible flowshop scheduling with no-idle machines
This paper considers a two-stage flexible flowshop scheduling problem with no waiting time between two sequential operations of a job and no idle time between two consecutive processed jobs on machines of the second stage. We show its complexity and present a heuristic algorithm with asymptotically tight error bounds. © 2004 Elsevier B.V. All rights reserved.
متن کاملMulti-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints
This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...
متن کاملIdentical parallel machine scheduling with time-dependent processing times
In the literature, most of the parallel-machine scheduling problems, in which the processing time of a job is a linear function of its starting time, are proved to be NP-hard. In this paper, we study a parallel-machine scheduling problem in which the processing time of a job is a linear function of its starting time. The objectives are to minimize the total completion of all jobs and the total ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sustainability
سال: 2021
ISSN: ['2071-1050']
DOI: https://doi.org/10.3390/su13169277